A Multi-commodity Flow Approach to the Crew Rostering Problem
نویسنده
چکیده
An airline crew rostering problem is a large-scaled and complex optimization problem that assigns crew members to the flight duties while satisfying agreements with the labor union, the government regulations, the carrier’s own policies, and other requirements. The traditional crew rostering problem considers only minimizing the total perdiem in order to reduce the airline expense. This paper presents the crew rostering problem for the international flights of Thai Airways with the major concern on the crew’s life quality. We propose a 0-1 multi-commodity flow problem whose objective function is to balance the per-diem and workloads among the crew members. Various test cases are generated from Thai Airways data set and solved by using the commercial optimizer, IBM ILOG CPLEX. The quality of the solutions and computational times are presented and also discussed the results.
منابع مشابه
A hybrid particle swarm optimization and an improved heuristic algorithm for an airline crew rostering problem
The airline crew scheduling problem is a combinatorial optimization problem and belongs to the class of NPhard problems. An effective method for solving the airline crew scheduling problem can reduce the crew costs and improve crew satisfaction. Because of its complexity, the problem is divided into two subproblems: the crew pairing problem and the crew rostering problem. In this paper, the cre...
متن کاملA Multicommodity Flow Approach to the Crew Rostering Problem
The problem of finding a work assignment for airline crew members in a given time horizon is addressed. In the literature this problem is usually referred to as the airline crew rostering problem. It consists of constructing monthly schedules for crew members by assigning them pairings, rest periods, annual and sick leave, training periods, union activities, and so forth, so as to satisfy the c...
متن کاملCyclic and non-cyclic crew rostering problems in public bus transit
The crew rostering problem arises in public transport bus companies, and addresses the task of assigning a given set of anonymous duties and some other activities, such as standbys and days off, to drivers or groups of drivers, without violating any complex labor union rules. Additionally, the preferences of drivers are considered during the assignment. The plan generated for each driver/group ...
متن کاملSolving Airline’s Pilot – Copilot Rostering Problem by Successive Bipartite Weighted Matching
In large airlines, the planning and scheduling of aircrafts and crews is a very important operation. It starts from the analysis of the customers’ demands, passes the stages including timetable construction, fleet planning, and crew pairing, finally ends up with crew rostering. During the past decades, researches had been focused on two complex problems: crew pairing problem and crew rostering ...
متن کاملEfficient Multi-Skill Crew Rostering via Constrained Sets
In this paper, we consider the Multi-skill Crew Rostering Problem. We propose a constraint programming approach based on constraint set variables. We prove that this approach yields an exponential factor improvement in the worst-case search space over the conventional constraint programming approach. To handle preferences, we follow a ''relax and enrich'' scheme of Schmidt. Using our approach, ...
متن کامل